Novshek's trick as a polynomial algorithm
نویسنده
چکیده
An algorithm is described that constructs, in a polynomial time, a Nash equilibrium in a finite game with additive aggregation and decreasing best responses. MSC2010 Classifications: 91A10; 91A04.
منابع مشابه
A Unified Approach for Design of Lp Polynomial Algorithms
By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...
متن کاملACTA UNIVERSITATIS APULENSIS Special Issue KARATSUBA AND TOOM-COOK METHODS FOR MULTIVARIATE POLYNOMIALS
Karatsuba and Toom-Cook are well-known methods used to efficiently multiply univariate polynomials and long integers. For multivariate polynomials, asymptotically good approaches like Kronecker’s trick combined with FFT become truly effective only when the degree is above some threshold. In this paper we analyze Karatsuba and some of Toom-Cook methods for multivariate polynomials, considering d...
متن کاملGlobal optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کاملSolving polynomial equations for minimal problems in computer vision
Epipolar geometry and relative camera pose computation are examples of tasks which can be formulated as minimal problems, i.e. they can be solved from a minimal number of image points. Finding the solution leads to solving systems of algebraic equations. Often, these systems are not trivial and therefore special algorithms have to be designed to achieve numerical robustness and computational ef...
متن کاملSpeeding up the Division and Square Root of Power Series
We present new algorithms for the inverse, division, and square root of power series. The key trick is a new algorithm – MiddleProduct or, for short, MP – computing the n middle coefficients of a (2n− 1)× n full product in the same number of multiplications as a full n × n product. This improves previous work of Brent, Mulders, Karp and Markstein, Burnikel and Ziegler. These results apply both ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 162 شماره
صفحات -
تاریخ انتشار 2014